A PARALLEL COMPUTATION SCHEME FOR IMPLICIT RUNGE-KUTTA METHODS AND THE ITERATIVELY B-CONVERGENCE OF ITS NEWTON ITERATIVE PROCESS

In this paper, based on the implicit Runge-Kutta(IRK) methods, we derive a class of parallel scheme that can be implemented on the parallel computers with Ns(N is a positive even number) processors efficiently, and discuss the iteratively B-convergence of the Newton iterative process for solving the algebraic equations of the scheme, secondly we present a strategy providing initial values parallelly for the iterative process. Finally, some numerical results show that our parallel scheme is higher efficient as N is not so large.     

Banach空间中含有无穷多个跳跃点的一阶脉冲积分-微分方程的无穷边值问题

通过建立一个新的比较引理,应用上下解方法和单调迭代技术,研究了Banach空间中含有无穷多个跳跃点的一阶脉冲积分-微分方程无穷边值问题在任意闭区间上最小解和最大解的存在性.     

Banach空间中渐近非扩张型映象的Ishikawa迭代序列的收敛问题

文章研究了Banach空间中渐近非扩张型映象的具误差的修正Ishikawa迭代序列的收敛问题，所得结果改进和发展了文献[1-6]的相关结果。     

An iterative stabilized fractional step algorithm for numerical solution of incompressible N–S equations

Stabilized fractional step algorithm has been widely employed for numerical solution of incompressible Navier–Stokes equations. However, smaller time step sizes are required to use for existing explicit and semi‐implicit versions of the algorithm due to their fully or partially explicit nature particularly for highly viscous flow problems. The purpose of this paper is to present two modified versions of the fractional step algorithm using characteristic based split and Taylor–Galerkin like based split. The proposed modified versions of the algorithm are based on introducing an iterative procedure into the algorithm and allow much larger time step sizes than those required to the preceding ones. A numerical study of stability at acceptable convergence rate and accuracy as well as capability in circumventing the restriction imposed by the LBB condition for the proposed iterative versions of the algorithm is carried out with the plane Poisseuille flow problem under different Reynolds numbers ranging from low to high viscosities. Numerical experiments in the plane Poisseuille flow and the lid‐driven cavity flow problems demonstrate the improved performance of the proposed versions of the algorithm, which are further applied to numerical simulation of the polymer injection moulding process. Copyright © 2005 John Wiley & Sons, Ltd.     

PERIODIC BOUNDARY VALUE PROBLEMS FOR FIRST ORDER FUNCTIONAL DIFFERENTIAL EQUATIONS

In this paper, we investigate the periodic boundary value problems for nonlinear first order functional differential equations. By establishing a new comparison result, criteria on the existence of maximal and minimal solutions are obtained.     

Numerical transformation methods: a constructive approach

Within group invariance theory we consider a constructive approach in order to define numerical transformation methods. These are initial-value methods for the solution of boundary value problems governed by ordinary differential equations. Here we consider the class of free boundary value problems governed by the most general second-order equation in normal form. For this class of problems the main theorem is concerned with the definition of an iterative transformation method. The definition of a noniterative method, applicable to a subclass of the original class of problems, follows as a corollary. Therefore, the proposed constructive approach allows us to establish a unifying framework for noniterative and iterative transformation methods.     

Weighted FOM and GMRES for solving nonsymmetric linear systems

This paper presents two new methods called WFOM and WGMRES, which are variants of FOM and GMRES, for solving large and sparse nonsymmetric linear systems. To accelerate the convergence, these new methods use a different inner product instead of the Euclidean one. Furthermore, at each restart, a different inner product is chosen. The weighted Arnoldi process is introduced for implementing these methods. After describing the weighted methods, we give the relations that link them to FOM and GMRES. Experimental results are presented to show the good performances of the new methods compared to FOM(m) and GMRES(m). This revised version was published online in August 2006 with corrections to the Cover Date.     

ANALYTIC SOLUTIONS OF AN ITERATIVE EQUATION WITH FIRST ORDER DERIVATIVE

This paper is concerned with a nonlinear iterative equation with first order derivative. By construction a convergent power series solution, analytic solutions for the original equation are obtained.     

Analysis of iterative methods for saddle point problems: a unified approach

In this paper two classes of iterative methods for saddle point problems are considered: inexact Uzawa algorithms and a class of methods with symmetric preconditioners. In both cases the iteration matrix can be transformed to a symmetric matrix by block diagonal matrices, a simple but essential observation which allows one to estimate the convergence rate of both classes by studying associated eigenvalue problems. The obtained estimates apply for a wider range of situations and are partially sharper than the known estimates in literature. A few numerical tests are given which confirm the sharpness of the estimates.